A bound on the size of separating hash families
نویسندگان
چکیده
The paper provides an upper bound on the size of a (generalized) separating hash family, a notion introduced by Stinson, Wei and Chen. The upper bound generalizes and unifies several previously known bounds which apply in special cases, namely bounds on perfect hash families, frameproof codes, secure frameproof codes and separating hash families of small type. © 2008 Elsevier Inc. All rights reserved.
منابع مشابه
A bound for separating hash families
This paper aims to present a new upper bound on the size of separating hash families. This bound improves previously known bounds for separating hash families of general type.
متن کاملA tight bound on the size of certain separating hash families
In this paper, we present a new lower bound on the size of separating hash families of type {wq−1 1 , w2} where w1 < w2. Our result extends the paper by Guo, Stinson and Tran on binary frameproof codes [Des. Codes Crypto. 77 (2015), 301–319]. This bound compares well against known general bounds, and is especially useful when trying to bound the size of strong separating hash families. We also ...
متن کاملSeparating hash families: A Johnson-type bound and new constructions
Separating hash families are useful combinatorial structures which are generalizations of many well-studied objects in combinatorics, cryptography and coding theory. In this paper, using tools from graph theory and additive number theory, we solve several open problems and conjectures concerning bounds and constructions for separating hash families. Firstly, we discover that the cardinality of ...
متن کاملConstructions of 2-Cover-Free Families and Related Separating Hash Families
Cover-free families (CFF) were considered from different subjects by numerous researchers. In this paper we mainly consider explicit constructions of (2; d)-cover-free families. We also determine the size of optimal 2-cover-free-families on 9, 10 and 11 points. Related separating hash families, which can be used to construct CFFs, are also discussed.
متن کاملOn optimal bounds for separating hash families
This paper concerns optimal bounds and constructions for separating hash families of type {1, w} and {2, 2}. We first prove optimal bounds for separating hash families of type {1, w} and show constructions of families achieving the bounds. As a by-product of the results we obtain a positive answer to a question put by Blackburn, Etzion, Stinson and Zaverucha recently. Next we study optimal boun...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Comb. Theory, Ser. A
دوره 115 شماره
صفحات -
تاریخ انتشار 2007